By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Volume 16, Issue 2, pp. 173-343

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

The Existence of 2×4 Grid-Block Designs and Their Applications

Yukiyasu Mutoh, Toshio Morihara, Masakazu Jimbo, and Hung-Lin Fu

pp. 173-178

Stirling Numbers for Complex Arguments: Asymptotics and Identities

Graeme Kemkes, Chiu Fan Lee, Donatella Merlini, and Bruce Richmond

pp. 179-191

Minimizing a Convex Cost Closure Set

Dorit S. Hochbaum and Maurice Queyranne

pp. 192-207

On Generalized Delannoy Paths

Jean-Michel Autebert and Sylviane R. Schwer

pp. 208-223

Contrast Optimal Threshold Visual Cryptography Schemes

C. Blundo, P. D'Arco, A. De Santis, and D. R. Stinson

pp. 224-261

Finite Subsets of the Plane are 18-Reconstructible

L. Pebody, A. J. Radcliffe, and A. D. Scott

pp. 262-275

Random Krylov Spaces over Finite Fields

Richard P. Brent, Shuhong Gao, and Alan G. B. Lauder

pp. 276-287

Makespan Minimization in Job Shops: A Linear Time Approximation Scheme

Klaus Jansen, Roberto Solis-Oba, and Maxim Sviridenko

pp. 288-300

Testing Bandwidth k for k-Connected Graphs

Konrad Engel and Sven Guttmann

pp. 301-312

Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme

M. Sviridenko

pp. 313-322

1-Hyperbolic Graphs

Hans-Jürgen Bandelt and Victor Chepoi

pp. 323-334

Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs

Jorgen Bang-Jensen, Jing Huang, and Anders Yeo

pp. 335-343